How a Robot Can Explore an Infinite Graph
نویسنده
چکیده
The Roomba rolls around your house and vacuums the carpets. Early models were known to get stuck in corners or to end up running in circles. If the robot has unlimited memory then you could just give it a map of the room and it would never get trapped or confused. In practice, the robot has limited memory, and for AI programmers, the less used the better. We want to model this problem mathematically, so we assume it’s a square room and we consider a grid to make it a discrete rather than continuous problem. So the graph is Pn Pn. We’ll consider more general graphs at the end.
منابع مشابه
A note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملParameters Identification of an Experimental Vision-based Target Tracker Robot Using Genetic Algorithm
In this paper, the uncertain dynamic parameters of an experimental target tracker robot are identified through the application of genetic algorithm. The considered serial robot is a two-degree-of-freedom dynamic system with two revolute joints in which damping coefficients and inertia terms are uncertain. First, dynamic equations governing the robot system are extracted and then, simulated nume...
متن کاملGathering Multiple Robots in a Ring and an Infinite Grid
Gathering can be coined as one of the primary interaction parameters in systems of autonomous mobile agents or sensors, known as robots. These robots are identical and placed in the nodes of an unlabeled graph. They operate in wait-look-compute-move cycles. In one cycle, first the sensors of the robots are activated independent of each other (wait). Then a robot takes a snapshot of the current ...
متن کامل